On the Number of Latin Squares
نویسندگان
چکیده
We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order 11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order n is divisible by f ! where f is a particular integer close to 1 2 n, (3) provide a formula for the number of Latin squares in terms of permanents of (+1, −1)-matrices, (4) find the extremal values for the number of 1-factorisations of k-regular bipartite graphs on 2n vertices whenever 1≤ k ≤ n≤ 11, (5) show that the proportion of Latin squares with a non-trivial symmetry group tends quickly to zero as the order increases.
منابع مشابه
On Some Features of Symmetric Diagonal Latin Squares
In this paper, we study the dependencies of the number of symmetric and doubly symmetric diagonal Latin squares on the order N. Using fast generator of diagonal Latin squares (augmented by symmetry checker), we determined these dependencies for order at most 8. We also found a number of doubly symmetric diagonal Latin squares of orders 12, 16 and 20.
متن کاملAn Algorithm to Construct Symmetric Latin Squares of Order q n forq ≥ 2 andn ≥ 1
Latin squares of order n exist for each n ≥ 1. There are severalways of constructing Latin squares. Also for n≥ 2, if the number of reduced Latin squares isknown, then the number of general Latin squares canbecalculated. This paperproposed a generalmethod to constructsymmetric Latin squares of orderq by using blocks of order q which have the basic property of a recursivealgorithmwith the use of...
متن کاملCycle Switches in Latin Squares
Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one clas...
متن کاملThe set of autotopisms of partial Latin squares
Symmetries of a partial Latin square are primarily determined by its autotopism group. Analogously to the case of Latin squares, given an isotopism Θ, the cardinality of the set PLSΘ of partial Latin squares which are invariant under Θ only depends on the conjugacy class of the latter, or, equivalently, on its cycle structure. In the current paper, the cycle structures of the set of autotopisms...
متن کاملLatin Squares in a Cayley Table
Let G be a finite group of order n ≥ 2 and T be the Cayley table of G. Obviously T is a Latin square. In this paper we study submatrices of T which are Latin squares. Let Lm(G) where m ≤ n be the number of Latin squares of order m in T . We compute Lm(G) and study some properties of such submatrices. Also we classify the Latin squares of order m in T and compute the number of each classes in so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005